Critical behavior in inhomogeneous random graphs
نویسندگان
چکیده
منابع مشابه
Critical behavior in inhomogeneous random graphs
We study the critical behavior of inhomogeneous random graphs where edges are present independently but with unequal edge occupation probabilities. We show that the critical behavior depends sensitively on the properties of the asymptotic degrees. Indeed, when the proportion of vertices with degree at least k is bounded above by k−τ+1 for some τ > 4, the largest critical connected component is ...
متن کاملInhomogeneous Random Graphs
The ‘classical’ random graphs, introduced by Erdős and Rényi half a century ago, are homogeneous in the sense that all their vertices play the same role and the degrees of the vertices tend to be concentrated around a typical value. Many graphs arising in the real world do not have this property, having, for example, power-law degree distributions. Thus there has been much recent interest in de...
متن کاملGeometric Inhomogeneous Random Graphs
For the theoretical study of real-world networks, we propose a model of scale-free randomgraphs with underlying geometry that we call geometric inhomogeneous random graphs (GIRGs).GIRGs generalize hyperbolic random graphs, which are a popular model to test algorithms forsocial and technological networks. Our generalization overcomes some limitations of hyperbolicrandom graphs, w...
متن کاملSusceptibility in Inhomogeneous Random Graphs
We study the susceptibility, i.e., the mean size of the component containing a random vertex, in a general model of inhomogeneous random graphs. This is one of the fundamental quantities associated to (percolation) phase transitions; in practice one of its main uses is that it often gives a way of determining the critical point by solving certain linear equations. Here we relate the susceptibil...
متن کاملNovel scaling limits for critical inhomogeneous random graphs
We find scaling limits for the sizes of the largest components at criticality for the rank-1 inhomogeneous random graphs with power-law degrees with exponent . We investigate the case where ∈ (3, 4), so that the degrees have finite variance but infinite third moment. The sizes of the largest clusters, rescaled by n−( −2)/( −1), converge to hitting times of a ‘thinned’ Lévy process. This process...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2012
ISSN: 1042-9832
DOI: 10.1002/rsa.20450